On a Conditionally Optimal Learning Automaton
نویسندگان
چکیده
منابع مشابه
Dictionary Automaton in Optimal
In this paper we describe the data structure of a time and space eecient string dictionary automaton, providing insertion and deletion of strings and nite state machine based substring searching. If the input alphabet is bounded and the pattern are mutually substring free an optimal worst case bound of O(jmj) for both insertion and deletion of a pattern m is achieved. The underlying structure i...
متن کاملLearning Stochastic Logical Automaton
This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic models through inductive generalisation. The inductive generalisation algorithms consist of three parts. The first part describes the graphical generalisation of state transition models. State transition models are generalised by a...
متن کاملLearning conditionally lexicographic preference relations
We consider the problem of learning a user’s ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general graphical representation called LP-trees which captures various natural classes of such preference relations, depending on whether the importance order between attributes and/or the local preferences on the domain of each attribute ...
متن کاملConditionally Optimal Algorithms for Generalized Büchi Games
Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives...
متن کاملA Parameter-Free Learning Automaton Scheme
For a learning automaton, a proper configuration of its learning parameters, which are crucial for the automaton’s performance, is relatively difficult due to the necessity of a manual parameter tuning before real applications. To ensure a stable and reliable performance in stochastic environments, parameter tuning can be a time-consuming and interactioncosting procedure in the field of LA. Esp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1992
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.28.742